Sets of orthogonal hypercubes of class r
نویسندگان
چکیده
منابع مشابه
The Geometry of Sets of Orthogonal Frequency Hypercubes
We extend the notion of a framed net, introduced by D. Jungnickel, V.C. Mavron, and T.P. McDonough in The geometry of frequency squares, J. Combinatorial Theory A, 96 (2001), 376–387, to that of a d-framed net of type `, where d ≥ 2 and 1 ≤ ` ≤ d − 1, and we establish a correspondence between d-framed nets of type ` and sets of mutually orthogonal frequency hypercubes of dimension d. We provide...
متن کاملCordial Sets of Hypercubes
For a graph G = (V,E) with a binary vertex coloring f : V (G)→ Z2, let vf (i) = |f−1(i)|. We say f is friendly if |vf (1) − vf (0)| ≤ 1, i.e., the number of vertices labeled 1 is the same or almost the same as the number of vertices labeled 0. The coloring f induces an edge labeling f ∗ : E(G) → Z2 defined by f ∗(uv) = f(u) + f(v) (mod 2), for each uv ∈ E(G). Let ef (i) = |{uv ∈ E(G) : f ∗(uv) ...
متن کاملOn the Structure of Orthogonal Latin Hypercubes
The structure of orthogonal Latin hypercubes(OLH) is established in vector space over GF(2). An upper bound on the number of columns of an OLH is given. An OLH whose number of columns reaches the upper bound are found for m = 3 and m = 4, while the cases for m 5 are still unknown.
متن کاملConstruction of Orthogonal Nearly Latin Hypercubes
Orthogonal Latin hypercubes (OLHs) are available for only a limited collection of run sizes. This paper presents a simple algorithm for constructing orthogonal designs that are nearly Latin hypercubes. The algorithm is based on the approach developed by Steinberg and Lin for OLH designs and can generate designs for all run sizes for which a Plackett-Burman design exists. The designs have good u...
متن کاملMinimum r-Star Cover of Class-3 Orthogonal Polygons
We are interested in the problem of covering simple orthogonal polygons with the minimum number of r-stars; an orthogonal polygon is an r-star if it is orthogonally convex and star-shaped. The problem has been considered by Worman and Keil who described an algorithm running in O(n 17 poly-log n) time where n is the size of the input polygon. In this paper, we consider the above problem on simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2012
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.10.001